On duality theory for non-convex semidefinite programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On duality theory for non-convex semidefinite programming

In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming. Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that the results of [2] can...

متن کامل

Strong Duality for Semidefinite Programming

It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as simplex and interior-point methods. However, the standard Lagrangian for nonlinear programs requires constraint qualifications to avoid duality gaps. Semidefinite linear programming (SDP) is a generalization of LP where the nonnegativity constraints are replaced by a s...

متن کامل

Semidefinite relaxations for non-convex quadratic mixed-integer programming

We present semidefinite relaxations for unconstrained nonconvex quadratic mixed-integer optimization problems. These relaxations yield tight bounds and are computationally easy to solve for mediumsized instances, even if some of the variables are integer and unbounded. In this case, the problem contains an infinite number of linear constraints; these constraints are separated dynamically. We us...

متن کامل

On duality theory of convex semi-infinite programming

where is a (possibly infinite) set, f : R ! R is an extended real valued function and g : R ! R. In the above formulation, a feasible point x 2 R is supposed to satisfy the constraints gðx,!Þ 0 for all !2 , and no structural assumptions are made about the set . In some situations it is natural to require that these constraints hold for almost every (a.e.) !2 . That is, the set is equipped with ...

متن کامل

Duality Theory of Non-convex Technologies

Duality Theory of production imposes a number of simplifying assumptions regarding the production technology, including various maintained convexity assumptions. Emphasizing the technological information content of alternative models, this paper challenges some widely held views on the role of convexity. The role of convexity in Duality Theory is asymmetric: While convexity is of importance in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2011

ISSN: 0254-5330,1572-9338

DOI: 10.1007/s10479-011-0861-z